Introducing Timers to π-Calculus
نویسنده
چکیده
We introduce a new concept of modeling timed behavior in pi-calculus by representing timed actions (or timers) as interactions between application processes and clock processes. This approach extends the original calculus in a manner such that bisimulation arrangements in pi-calculus remain untouched.
منابع مشابه
Timers for Distributed Systems 1
We deal with temporal aspects of distributed systems, introducing and studying a new model called timed distributed π-calculus. This model extends distributed π-calculus with timers, transforming the communication channels into temporary resources. Distributed π-calculus describes located interactions between processes with restricted access to resources. We introduce time constraints by consid...
متن کاملTowards abstractions for distributed systems
For historical, sociological and technical reasons, λ-calculi have been the dominant theoretical paradigm in the study of functional computation. Similarly, but to a lesser degree, π-calculi dominate advanced mathematical accounts of concurrency. Alas, and despite its ever increasing ubiquity, an equally convincing formal foundation for distributed computing has not been forthcoming. This thesi...
متن کاملBarbed Bisimulations for Timed Distributed π-calculus
Modelling distributed systems requires notions as locations, communication among the distributed processes, and resource access. To express time constraints for such systems, we have introduced timed distributed π-calculus called tDπ as an extension of the π-calculus with locations, types and timers. Timers define both timeouts for communication channels and timeouts for resources. We define th...
متن کاملCoordination by Timers for Channel-Based Anonymous Communications
In considering systems of distributed processes, we must deal with access to resources, locations and communication among processes. In this paper we present a new model for timed coordination of communicating distributed processes using an extension of the π-calculus with locations, types and timers. Types are used to express restricted access to distributed resources. Timers de ne timeouts fo...
متن کاملBasic Theory of Reduction Congruence for Two Timed Asynchronous π-Calculi
We study reduction congruence, a popular notion of process equality, for the asynchronous π-calculus with timers, and derive several alternative characterisations, one of them being a labelled asynchronous bisimilarity. These results are adapted to an asynchronous π-calculus with timers, locations and message failure. In addition we investigate the problem of how to distribute value-passing pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012